mm-GNAT: Index Structure for Arbitrary Lp Norm

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

mm-GNAT: index structure for arbitrary Lp norm

For fast ε-similarity search, various index structures have been proposed. Yi et al. proposed a concept multimodality support and suggested inequalities by which εsimilarity search by L1, L2 and L∞ norm can be realized. We proposed an extended inequality which allows us to realize ε-similarity search by arbitrary Lp norm using an index based on Lq norm. In these investigations a search radius o...

متن کامل

Similarity Search in Arbitrary Subspaces Under Lp-Norm

Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves all data objects in a data set that are similar to a given query object. Previous work on similarity search usually consider the search problem in the full space. In this paper, however, we propose a novel problem, s...

متن کامل

Boosting quantization for Lp norm distortion measure

Quantization is a widely used technique in signal processing. The purpose of many quantization schemes is to faithfully reproduce the input signals. However, in many situations, one is more interested in comparison of different classes of signals in order to classify them into different categories. The classification criterion is based on comparing distances under certain metric. For classical ...

متن کامل

lp-Norm Multiple Kernel Learning

Learning linear combinations of multiple kernels is an appealing strategy when the right choice of features is unknown. Previous approaches to multiple kernel learning (MKL) promote sparse kernel combinations to support interpretability and scalability. Unfortunately, this l1-norm MKL is rarely observed to outperform trivial baselines in practical applications. To allow for robust kernel mixtur...

متن کامل

Arbitrary Norm Support Vector Machines

Support vector machines (SVM) are state-of-the-art classifiers. Typically L2-norm or L1-norm is adopted as a regularization term in SVMs, while other norm-based SVMs, for example, the L0-norm SVM or even the L(infinity)-norm SVM, are rarely seen in the literature. The major reason is that L0-norm describes a discontinuous and nonconvex term, leading to a combinatorially NP-hard optimization pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IPSJ Online Transactions

سال: 2010

ISSN: 1882-6660

DOI: 10.2197/ipsjtrans.3.139